Parallel color-coding

Fast Parallel Fixed-parameter Algorithms via Color Coding

Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently sequential and, thus, make no use of the parallel hardware present in modern computers. We show that parallel fixed-parameter algorithms do not only exist for numerous parameterized problems from the...

Extended Quantum Color Coding

The quantum color coding scheme proposed by Korff and Kempe [1] is easily extended so that the color coding quantum system is allowed to be entangled with an extra auxiliary quantum system. It is shown that in the extended scheme we need only ∼ 2 √ N quantum colors to order N objects in large N limit, whereas ∼ N/e quantum colors are required in the original non-extended version. The maximum su...

Mixing Color Coding-Related Techniques

In the past two decades, several breakthrough techniques, known as “color coding-related techniques”, lead to the design of extremely fast parameterized algorithms. In this paper, we introduce a family of strategies, that we call “mixing strategies”, for applying these techniques, developing even faster, closer to optimal, parameterized algorithms. Our strategies combine the following novel ide...

Color coding to reduce errors.

Arithmetic Coding in Parallel

We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.